Deconstructing the Zeilberger algorithm

نویسنده

  • DORON ZEILBERGER
چکیده

By looking under the hood of Zeilberger’s algorithm, as simplified by Mohammed and Zeilberger, it is shown that all the classical hypergeometric closed-form evaluations can be discovered ab initio, as well as many “strange” ones of Gosper, Maier, and Gessel and Stanton. The accompanying Maple package FindHypergeometric explains the various miracles that account for the classical evaluations, and the more specialized Maple package twoFone, also accompanying this article, finds many “strange” 2F1 evaluations, and these discoveries are in some sense, exhaustive. Hence WZ theory is transgressing the boundaries of the context of justification into the context of discovery.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms

We do what the title promises, and as a bonus, we get much simplified versions of these algorithms, that do not make any explicit mention of Gosper’s algorithm. © 2004 Elsevier Ltd. All rights reserved.

متن کامل

The Method of Creative Telescoping

In Zeilberger (preprint) it was shown that Joseph N. Bernstein's theory of holonomic systems (Bernstein, 1971; Bjork, 1979) forms a natural framework for proving a very large class of special function identities. A very general, albeit slow, algorithm for proving any such identity was given. In Zeilberger (to appear) a much faster algorithm was given for the important special case of hypergeome...

متن کامل

The Abel-Zeilberger Algorithm

We use both Abel’s lemma on summation by parts and Zeilberger’s algorithm to find recurrence relations for definite summations. The role of Abel’s lemma can be extended to the case of linear difference operators with polynomial coefficients. This approach can be used to verify and discover identities involving harmonic numbers and derangement numbers. As examples, we use the Abel-Zeilberger alg...

متن کامل

A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities

Gosper’s algorithm for indefinite hypergeometric summation, see e.g. Gosper (1978) or Lafon (1983) or Graham, Knuth and Patashnik (1989), belongs to the standard methods implemented in most computer algebra systems. Exceptions are, for instance, the 2.xVersions of the Mathematica system where symbolic summation is done by different means. A brief discussion is given in section 5. Current intere...

متن کامل

Nonterminating Basic Hypergeometric Series and the q-Zeilberger Algorithm

We present a systematic method for proving nonterminating basic hypergeometric identities. Assume that k is the summation index. By setting a parameter x to xqn, we may find a recurrence relation of the summation by using the q-Zeilberger algorithm. This method applies to almost all nonterminating basic hypergeometric summation formulas in the book of Gasper and Rahman. Furthermore, by comparin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005